Improved and Extended Mixed-Radix Decimation in Frequency Fast MDCT Algorithm
نویسنده
چکیده
Recently, a mixed-radix decimation in frequency (DIF) fast MDCT algorithm only for the mixed-radix decompositions or composite lengths N = 3m×2, m > 0, has been proposed in [4]. An improved mixed-radix DIF fast MDCT algorithm both in terms of the regularity and computational complexity is described. Based on observed simple algebraic identities in the original proposed algorithm [4], new formulas are derived resulting in a very regular computational structure. Consequently, the number of arithmetic operations is reduced significantly. Moreover, the improved algorithm is extended to all composite lengths N = 3m×2p, m, p > 0. The improved algorithm defines new sparse matrix factorizations of the MDCT matrix for the composite lengths N = 3 × 2, m, p > 0, and finally it provides new implementations of the forward/backward MDCT in MPEG-1/2 layer III (MP3) audio coding standard.
منابع مشابه
Mixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملDesign and Simulation of 32-Point FFT Using Mixed Radix Algorithm for FPGA Implementation
This paper focus on the development of the fast Fourier transform (FFT), based on Decimation-In-Time (DIT) domain by using Mixed-Radix algorithm (Radix-4 and Radix-8).Fast Fourier transforms, popularly known as FFTs, have become an integral part of any type of digital communication system and a wide variety of approaches have been tried in order to optimize the algorithm for a variety of parame...
متن کاملSome New Results in Fast Hartley Transform Algorithms - M.S. Thesis
Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...
متن کاملA generator of memory-based, runtime-reconfigurable 2N3M5K FFT engines
Runtime-reconfigurable, mixed-radix FFT/IFFT engines are essential for modern wireless communication systems. To comply with varying standards requirements, these engines are customized for each modem. The Chisel hardware construction language has been used in this work to create a generator of runtimereconfigurable 235 FFT engines targeting software-defined radios (SDR) for modern communicatio...
متن کاملParallel-Pipelined Radix-6 Multipath Delay Commutator FFT Architectures
The new Proposed design has been designed and developed by novel parallel-pipelined Fast Fourier Transform (FFT) architecture. The most important and fastest efficient algorithm is a FFT. FFT is used to computes the Discrete Fourier Transform (DFT). FFT is mainly applied in autocorrelation, spectrum analysis, linear filtering and pattern recognition system. The proposed architectures were desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing and Informatics
دوره 29 شماره
صفحات -
تاریخ انتشار 2010